Article 349

Title of the article

THE NOTATION OF CLOSELY COUPLED REAL-TIME SCHEDULES
WITH REGARD TO INTERNAL METADATA 

Authors

Yankov Igor Alexandrovich, Postgraduate student, Penza State University, igor.yankov@gmail.com
Shibanov Sergey Vladimirovich, Candidate of engineering sciences, associate professor, sub-department of computer application and software, Penza State University, serega@pnzgu.ru
Shashkov Boris Dmitrievich, Candidate of engineering sciences, professor, dean of the department of computer sciences, Penza State University, pm@pnz.ru

Index UDK

519.16

Abstract

The paper gives overview of main modern types of schedules, defines the new tightly coupled kind of schedules and fields of its applications. The author suggests special notation for generation and processing such kind of schedule. The rent-a-car business domain is presented as main demonstration example of usage of basic features of the suggested notation. In conclusion the author describes the first results of the notation utility and forms the direction of the future development.

Key words

scheduling algorithm, notation of the schedule, open shop scheduling, task’s tree, rent-a-car business, inner metainforamation, task-operation links, real-time schedule, scheduling theory.

Download PDF

 

Дата создания: 20.08.2014 09:12
Дата обновления: 21.08.2014 09:19